Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming
نویسندگان
چکیده
منابع مشابه
Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by a polynomial or a rational function, then the semi-infinite program can be reformulated as an equivalent semidefinite program. Solving this semidefinite pro...
متن کاملSemi-infinite linear programming approaches to semidefinite programming problems∗
Interior point methods, the traditional methods for the SDP , are fairly limited in the size of problems they can handle. This paper deals with an LP approach to overcome some of these shortcomings. We begin with a semi-infinite linear programming formulation of the SDP and discuss the issue of its discretization in some detail. We further show that a lemma due Pataki on the geometry of the SDP...
متن کاملGenerating Non-linear Interpolants by Semidefinite Programming
Interpolation-based techniques have been widely and successfully applied in the verification of hardware and software, e.g., in bounded-model checking, CEGAR, SMT, etc., whose hardest part is how to synthesize interpolants. Various work for discovering interpolants for propositional logic, quantifier-free fragments of first-order theories and their combinations have been proposed. However, litt...
متن کاملSemi-infinite programming
A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The paper, which intends to make a compromise between an introduction and a survey, treats the theoretical basis, numerical methods, ...
متن کاملSemidefinite Programming vs. LP Relaxations for Polynomial Programming
We consider the global minimization of a multivariate polynomial on a semi-algebraic set defined with polynomial inequalities. We then compare two hierarchies of relaxations, namely, LP relaxations based on products of the original constraints, in the spirit of the RLT procedure of Sherali and Adams (1990), and recent semidefinite programming (SDP) relaxations introduced by the author. The comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2017
ISSN: 1052-6234,1095-7189
DOI: 10.1137/15m1053578